Grammatical inference : algorithms and applications (Lisbon, 11-13 September 2000)Oliveira, Arlindo L.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-41011-2, VIII, 311 p, isbn 3-540-41011-2Conference Proceedings

Iterated transductions and efficient learning from positive data : A unifying viewKOBAYASHI, S.Lecture notes in computer science. 2000, pp 157-170, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Inference of finite-state transducers by using regular grammars and morphismsCASACUBERTA, F.Lecture notes in computer science. 2000, pp 1-14, issn 0302-9743, isbn 3-540-41011-2Conference Paper

An inverse limit of context-free grammars: A new approach to identifiability in the limitMARTINEK, P.Lecture notes in computer science. 2000, pp 171-185, issn 0302-9743, isbn 3-540-41011-2Conference Paper

The induction of temporal grammatical rules from multivariate time seriesGUIMARAES, G.Lecture notes in computer science. 2000, pp 127-140, issn 0302-9743, isbn 3-540-41011-2Conference Paper

SPIRE 2002 : string processing and information retrieval (Lisbon, 11-13 September 2002)Laender, Alberto H.F; Oliveira, Arlindo L.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-44158-1, XI, 336 p, isbn 3-540-44158-1Conference Proceedings

The DBLP Computer Science bibliography: Evolution, research issues, perspectivesLEY, Michael.Lecture notes in computer science. 2002, pp 1-10, issn 0302-9743, isbn 3-540-44158-1, 10 p.Conference Paper

Learning context-free grammars from partially structured examplesSAKAKIBARA, Y; MURAMATSU, H.Lecture notes in computer science. 2000, pp 229-240, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Smoothing probabilistic automata : An error-correcting approachDUPONT, P; AMENGUAL, J.-C.Lecture notes in computer science. 2000, pp 51-64, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Tree pattern matching for linear static termsCHAUVE, Cedric.Lecture notes in computer science. 2002, pp 160-169, issn 0302-9743, isbn 3-540-44158-1, 10 p.Conference Paper

On the relationship between models for learning in helpful environmentsPAREKH, R; HONAVAR, V.Lecture notes in computer science. 2000, pp 207-220, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Counting extensional differences in BC-learningSTEPHAN, F; TERWIJN, S. A.Lecture notes in computer science. 2000, pp 256-269, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Pattern matching over multi-attribute data streamsHARADA, Lilian.Lecture notes in computer science. 2002, pp 187-193, issn 0302-9743, isbn 3-540-44158-1, 7 p.Conference Paper

Synthesizing context free grammars from sample strings based on inductive CYK algorithmNAKAMURA, K; ISHIWATA, T.Lecture notes in computer science. 2000, pp 186-195, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Efficient ambiguity detection in C-NFA: A step towards the inference of non deterministic automataCOSTE, F; FREDOUILLE, D.Lecture notes in computer science. 2000, pp 25-38, issn 0302-9743, isbn 3-540-41011-2Conference Paper

A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sampleTAJIMA, Y; TOMITA, E.Lecture notes in computer science. 2000, pp 284-297, issn 0302-9743, isbn 3-540-41011-2Conference Paper

On the complexity of consistent identification of some classes of structure languagesCOSTA FLORENCIO, C.Lecture notes in computer science. 2000, pp 89-102, issn 0302-9743, isbn 3-540-41011-2Conference Paper

From searching text to querying XML streamsSUCIU, Dan.Lecture notes in computer science. 2002, pp 11-26, issn 0302-9743, isbn 3-540-44158-1, 16 p.Conference Paper

Indexing text using the Ziv-Lempel trieNAVARRO, Gonzalo.Lecture notes in computer science. 2002, pp 325-336, issn 0302-9743, isbn 3-540-44158-1, 12 p.Conference Paper

Computation of substring probabilities in stochastic grammarsFRED, A. L. N.Lecture notes in computer science. 2000, pp 103-114, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Improve the learning of subsequential transducers by using alignments and dictionariesVILAR, J. M.Lecture notes in computer science. 2000, pp 298-311, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Faster string matching with super-alphabetsFREDRIKSSON, Kimmo.Lecture notes in computer science. 2002, pp 44-57, issn 0302-9743, isbn 3-540-44158-1, 14 p.Conference Paper

A theoretical analysis of Google's PageRankPRETTO, Luca.Lecture notes in computer science. 2002, pp 131-144, issn 0302-9743, isbn 3-540-44158-1, 14 p.Conference Paper

Permutations and control sets for Learning non-regular language familiesFERNAU, H; SEMPERE, J. M.Lecture notes in computer science. 2000, pp 75-88, issn 0302-9743, isbn 3-540-41011-2Conference Paper

On the size of DASG for multiple textsCROCHEMORE, Maxime; TRONICEK, Zdenek.Lecture notes in computer science. 2002, pp 58-64, issn 0302-9743, isbn 3-540-44158-1, 7 p.Conference Paper